Monic integer Chebyshev problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monic integer Chebyshev problem

We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let Mn(Z) denote the monic polynomials of degree n with integer coefficients. A monic integer Chebyshev polynomial Mn ∈ Mn(Z) satisfies ‖Mn‖E = inf Pn∈Mn(Z) ‖Pn‖E . and the monic integer Chebyshev constant is then defined by tM (E) := lim n→∞ ‖Mn‖ E . This is the obvious analogue of the more usu...

متن کامل

The integer Chebyshev problem

We are concerned with the problem of minimizing the supremum norm on an interval of a nonzero polynomial of degree at most n with integer coefficients. This is an old and hard problem that cannot be exactly solved in any nontrivial cases. We examine the case of the interval [0, 1] in most detail. Here we improve the known bounds a small but interesting amount. This allows us to garner further i...

متن کامل

The Multivariate Integer Chebyshev Problem

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in C. We study this problem on general sets, but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert-Fekete upper bound for the integer Chebyshev constant, which depends on the dimens...

متن کامل

The monic integer transfinite diameter

We study the problem of finding nonconstant monic integer polynomials, normalized by their degree, with small supremum on an interval I. The monic integer transfinite diameter tM(I) is defined as the infimum of all such supremums. We show that if I has length 1, then tM(I) = 1 2 . We make three general conjectures relating to the value of tM(I) for intervals I of length less than 4. We also con...

متن کامل

Generalized Gorshkov-Wirsing Polynomials and the Integer Chebyshev Problem

Interval LLL SIMPLEX HS Amoroso Lower # CP [-1, 1] 1/1.5314 1/1.5334 1/1.4772 1/1.4520 1/1.5417 8 [-1/2, 1/2] 1/2.3559 1/2.3619 1/2.1822 1/1.4520 1/2.3768 9 [-1/3, 1/3] 1/3.2522 1/3.2617 1/3.0000 1/1.3887 1/3.2842 7 [-2/3, 2/3] 1/1.8820 1/1.8883 1/1.7237 1/1.3887 1/1.9845 5 [-1/4, 1/4] 1/4.1921 1/4.2025 1/4.0000 1/1.1097 1/4.2260 6 [-3/4, 3/4] 1/1.7897 1/1.7935 1/1.7237 1/1.1097 1/1.9653 3 [-1/...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2003

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-03-01477-7